Space-Optimal Semi-Streaming for $(2+\epsilon)$-Approximate Matching
نویسنده
چکیده
In a recent breakthrough, Paz and Schwartzman [SODA’17] presented a single-pass (2 + ε)approximation algorithm for the maximum weight matching problem in the semi-streaming model. Their algorithm uses O(n log n) bits of space, for any constant ε > 0. In this note, we present a different analysis, for essentially the same algorithm, that improves the space complexity to the optimal bound of O(n logn) bits, while also providing a more intuitive explanation of the process. This space complexity is optimal because just keeping the matching needs Ω(n logn) bits.
منابع مشابه
A $(2+\epsilon)$-Approximation for Maximum Weight Matching in the Semi-Streaming Model
We present a simple deterministic single-pass (2 + ǫ)-approximation algorithm for the maximum weight matching problem in the semi-streaming model. This improves upon the currently best known approximation ratio of (3.5 + ǫ). Our algorithm uses O(n log n) space for constant values of ǫ. It relies on a variation of the local-ratio theorem, which may be of use for other algorithms in the semi-stre...
متن کاملGraph Sparsification in the Semi-streaming Model
Analyzing massive data sets has been one of the key motivations for studying streaming algorithms. In recent years, there has been significant progress in analysing distributions in a streaming setting, but the progress on graph problems has been limited. A main reason for this has been the existence of linear space lower bounds for even simple problems such as determining the connectedness of ...
متن کاملAlgorithms for streaming graphs
An algorithm solving a graph problem is usually expected to have fast random access to the input graph G and a working memory that is able to store G completely. These powerful assumptions are put in question by massive graphs that exceed common working memories and that can only be stored on disks or even tapes. Here, random access is very time-consuming. To tackle massive graphs stored on ext...
متن کاملA Approximating Semi-matchings in Streaming and in Two-party Communication
We study the streaming complexity and communication complexity of approximating unweighted semimatchings. A semi-matching in a bipartite graph G = (A,B,E) with n = |A| is a subset of edges S ⊆ E that matches all A vertices to B vertices with the goal usually being to do this as fairly as possible. While the term semi-matching was coined in 2003 by Harvey et al. [WADS 2003, also Journal of Algor...
متن کاملMaximum Matching in Semi-streaming with Few Passes
In the semi-streaming model, an algorithm receives a stream of edges of a graph in arbitrary order and uses a memory of size O(npolylogn), where n is the number of vertices of a graph. In this work, we present semi-streaming algorithms that perform one or two passes over the input stream for Maximum Matching with no restrictions on the input graph, and for the important special case of bipartit...
متن کامل